An Exact and an Approximation Method to Compute the Degree Distribution of Inhomogeneous Random Graph Using Poisson Binomial Distribution

Inhomogeneous random graphs are commonly used models for complex networks where nodes have varying degrees of connectivity. Computing the degree distribution such is a fundamental problem and has important applications in various fields. We define inhomogeneous graph as model edges drawn independently probability link between any two vertices can be different each node pair. In this paper, we present an exact approximation method to compute using Poisson binomial distribution. The algorithm utilizes DFT-CF variable. uses Poisson, binomial, Gaussian distributions approximate